Meta-Evolution in Graph GP
نویسندگان
چکیده
In this contribution we investigate the evolution of operators for Genetic Programming by means of Genetic Programming. Metaevolution of recombination operators in graph-based GP is applied and compared to other methods for the variation of recombination operators in graph-based GP. We demonstrate that a straightforward application of recombination operators onto themselves does not work well. After introducing an additional level of recombination operators (the meta level) which are recombining a pool of recombination operators, even self-recombination on the additional level becomes feasible. We show that the overall performance of this system is better than in other variants of graph GP. As a test problem we use speaker recognition.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملCompositional Autoconstructive Dynamics
Autoconstructive evolution is the idea of evolving programs through self-creation. This is an alternative to the hand-coded variation operators utilized in traditional genetic programming (GP) and the deliberately limited implementations of meta-GP. In the latter case strategies generally involve adapting the variation operators which are then used in accordance with traditional GP. On the othe...
متن کاملCo-transformation of Graphs and Type Graphs with Application to Model Co-evolution
Meta-modeling has become the key technology to define do– main-specific modeling languages in model-driven engineering. Since do– main-specific modeling languages often change quite frequently, concepts are needed for the coordinated evolution of their meta-models as well as of their models, and possibly other related artifacts. In this paper, we present a new approach to the co-transformation ...
متن کاملEvolution of Graph-Like Programs with Parallel Distributed Genetic Programming
Parallel Distributed Genetic Programming (PDGP) is a new form of Genetic Programming (GP) suitable for the development of programs with a high degree of parallelism. Programs are represented in PDGP as graphs with nodes representing functions and terminals, and links representing the flow of control and results. The paper presents the representations, the operators and the interpreters used in ...
متن کاملSysgp { a C++ Library of Diierent Gp Variants
In recent years di erent variants of genetic programming (GP) have emerged all following the basic idea of GP, the automatic evolution of computer programs. Today, three basic forms of representation for genetic programs are used, namely tree, graph and linear structures. We introduce a multi-representation system, SYSGP, that allows researchers to experiment with di erent representations with ...
متن کامل